Ordering trees by their Laplacian spectral radii
نویسندگان
چکیده
Denote by Tn the set of trees on n vertices. Zhang and Li [X.D. Zang, J.S. Li, The two largest eigenvalues of Laplacian matrices of trees (in Chinese), J. China Univ. Sci. Technol. 28 (1998) 513–518] and Guo [J.M. Guo, On the Laplacian spectral radius of a tree, Linear Algebra Appl. 368 (2003) 379–385] give the first four trees in Tn, ordered according to their Laplacian spectral radii. In this paper, we determine the fifth to eighth trees in the above ordering. © 2005 Elsevier Inc. All rights reserved. AMS classification: 05C50; 15A18
منابع مشابه
SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملOrdering of the signless Laplacian spectral radii of unicyclic graphs
For n ≥ 11, we determine all the unicyclic graphs on n vertices whose signless Laplacian spectral radius is at least n− 2. There are exactly sixteen such graphs and they are ordered according to their signless Laplacian spectral radii.
متن کاملORDERING CACTI WITH n VERTICES AND k CYCLES BY THEIR LAPLACIAN SPECTRAL RADII
A graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the first sixteen largest Laplacian spectral radii together with the corresponding graphs among all connected cacti with n vertices and k cycles, where n > 2k + 8.
متن کاملSome results on the ordering of the Laplacian spectral radii of unicyclic graphs
A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo Shu-Guang [S.G. Guo, The largest Laplacian spectral radius of unicyclic graph, Appl. Math. J. Chinese Univ. Ser. A. 16 (2) (2001) 131–135] determined the first four largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices. In this paper, we extend th...
متن کاملOn ordering bicyclic graphs with respect to the Laplacian spectral radius
A connected graph of order n is bicyclic if it has n+1 edges. He et al. [C.X. He, J.Y. Shao, J.L. He, On the Laplacian spectral radii of bicyclic graphs, Discrete Math. 308 (2008) 5981–5995] determined, among the n-vertex bicyclic graphs, the first four largest Laplacian spectral radii together with the corresponding graphs (six in total). It turns that all these graphs have the spectral radius...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005